Partition properties on Pκλ
نویسندگان
چکیده
منابع مشابه
On Reflection of Stationary Sets in Pκλ
Let κ be an inaccessible cardinal, and let E0 = {x ∈ Pκκ : cf λx = cf κx} and E1 = {x ∈ Pκκ : κx is regular and λx = κx }. It is consistent that the set E1 is stationary and that every stationary subset of E0 reflects at almost every a ∈ E1.
متن کاملNonreflecting Stationary Sets in Pκλ
Let κ be a regular uncountable cardinal and λ ≥ κ. The principle of stationary reflection for Pκλ has been successful in settling problems of infinite combinatorics in the case κ = ω1. For a greater κ the principle is known to fail at some λ. This note shows that it fails at every λ if κ is the successor of a regular uncountable cardinal or κ is countably closed.
متن کاملOn Congruence Properties of the Partition Function
Some congruence properties of the partition function are proved.
متن کاملSortabilities of Partition Properties
Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to some small class of partitions. Recently, Hwang, Rothblum and Yao defined and studied the sortability of these partition properties as a tool to prove the existence of a partition with such a property in a given fami...
متن کاملOn Properties and State Complexity of Deterministic State-Partition Automata
A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P (L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 2002
ISSN: 0025-5645
DOI: 10.2969/jmsj/1191593957